BEAVER: a computational-geometry-based tool for switchbox routing
نویسندگان
چکیده
منابع مشابه
Packing Steiner trees: a cutting plane algorithm and computational results
In this paper we describe a cutting plane algorithm for the Steiner tree packing problem. We use our algorithm to solve some switchbox routing problems of VLSI-design and report on our computational experience. This includes a brief discussion of separation algorithms, a new LP-based primal heuristic and implementation details. The paper is based on the polyhedral theory for the Steiner tree pa...
متن کاملGasbor: a Genetic Algorithm Approach for Solving the switchbox Routing Problem
A new genetic algorithm for switchbox routing in the physical design process of integrated circuits is presented. Our algorithm, called GASBOR (Genetic Algorithm for SwitchBOx Routing), is based on a three-dimensional representation of the switchbox and problem-speciic genetic operators. The performance of the algorithm is tested on diierent benchmarks and it is shown that the results obtained ...
متن کاملAdditive Approximation for Layer Minimization of Manhattan Switchbox Routing
Switchbox routing is one of the many problems arising in the field of VLSI routing. It requires interconnecting given sets of terminals that are placed on the boundaries of a rectangular circuit board using a 3-dimensional grid in a vertex-disjoint way. An important special case is the Manhattan Switchbox Routing problem. Here minimizing the number of layers of a routing (that is, the height of...
متن کاملOn the NP–Completeness of Channel and Switchbox Routing Problems
The design of integrated circuits has achieved a great deal of attention in the last decade. In the routing phase, an open layout problem has survived which is important from both the theoretical and the practical point of view. The channel routing problem has been known to be solvable in polynomial time when there are only 2–terminal nets, and is proved by Sarrafzadeh to be NP–complete in case...
متن کاملRouting Through a Generalized Switchbox
We present an algorithm for the routing problem for two-tenninal nets in generalized switchboxes. A generalized s\~itchbox is any subset R of the planar rectangular grid with no non-trivial holes, i.e. every finite face has exactly four incident vertices. A net is a pair of nodes of non-maximal degree on the boundary of R. A solution is a set of edge-disjoint paths, one for each net. Our algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 7 شماره
صفحات -
تاریخ انتشار 1988